A 2/3-approximation algorithm for vertex-weighted matching

A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial scientific computing. Since an exact algorithm for the weighted matching problem is both fairly expensive to compute and hard to parallelise we instead consider fast approximation

A simple approximation algorithm for the weighted matching problem

Efficient Approximation Algorithms for Weighted b-Matching

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we...

An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight function w. In this paper, we show that a weak vertex cover set approximating a minimum one within 2− 2 ν(G) can be efficiently found in undirected graphs, and improve the previous work of approximation ratio within ln d + ...

An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity

This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intensively studied in recent years. Given a dynamically changing vertex-weighted graph G = (V,E), which allows edge insertions and edge deletions, the goal is to design a data structure that maintains an approximate minimu...